A Parallel Similarity Search in High Dimensional Metric Space Using M-Tree
نویسندگان
چکیده
In this study, parallel implementation of M-tree to index high dimensional metric space has been elaborated and an optimal declustering technique has been proposed. First, we have defined the optimal declustering and developed an algorithm based on this definition. Proposed declustering algorithm considers both object proximity and data load on disk/processors by executing a k-NN or a range query for each newly inserted objects. We have tested our algorithm in a database containing randomly chosen 1000 image’s color histograms with 32 bins in HSV color space. Experimentation showed that our algorithm produces a very near optimal declustering.
منابع مشابه
MLR-Index: An Index Structure for Fast and Scalable Similarity Search in High Dimensions
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collections, time-series data, sensor data and scientific databases. Because of the curse of dimensionality, it is already known that well-known data structures like kd-tree, R-tree, and M-tree suffer in their performance over...
متن کاملBM+-Tree: A Hyperplane-Based Index Method for High-Dimensional Metric Spaces
In this paper, we propose a novel high-dimensional index method, the BM-tree, to support efficient processing of similarity search queries in high-dimensional spaces. The main idea of the proposed index is to improve data partitioning efficiency in a high-dimensional space by using a rotary binary hyperplane, which further partitions a subspace and can also take advantage of the twin node conce...
متن کاملParallel Va-file
Similarity search is one of the typical query type for multimedia retrieval, data mining and decision support systems. Many similarity measures transform objects into points in a high-dimensional vector space and deene similarity of two objects with respect to their distance in the vector space. Data-partitioning index methods for such spaces like R-tree or X-tree are known to deteriorate with ...
متن کاملPartial Shape Retrieval by M-tree and a Bayesian Approach
An important problem in accessing and retrieving visual information is to provide efficient similarity machining in large databases. In this paper we propose partial retrieval by the shape similarity using Curvature Scale Space and an effective indexing using metric trees and a Bayesian approach. Each shape is partitioned into token attributes. Tokens are organized in a tree structure called M-...
متن کاملAn Index Data Structure for Searching in Metric Space Databases
This paper presents the Evolutionary Geometric Near-neighbor Access Tree (EGNAT) which is a new data structure devised for searching in metric space databases. The EGNAT is fully dynamic, i.e., it allows combinations of insert and delete operations, and has been optimized for secondary memory. Empirical results on different databases show that this tree achieves good performance for high-dimens...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001